// 判断链表是否有环
function hasCycle(head) {
    while (head) {
        if (head.tag) return true
        headA.tag = true;
        headA = headA.next
    }
    return false
}